Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
نویسندگان
چکیده
منابع مشابه
Duality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملOn duality theory for non-convex semidefinite programming
In this paper, with the help of convex-like function, we discuss the duality theory for nonconvex semidefinite programming. Our contributions are: duality theory for the general nonconvex semidefinite programming when Slater’s condition holds; perfect duality for a special case of the nonconvex semidefinite programming for which Slater’s condition fails. We point out that the results of [2] can...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملDuality and Convex Programming
This chapter surveys key concepts in convex duality theory and their application to the analysis and numerical solution of problem archetypes in imaging.
متن کاملOn duality theory of convex semi-infinite programming
where is a (possibly infinite) set, f : R ! R is an extended real valued function and g : R ! R. In the above formulation, a feasible point x 2 R is supposed to satisfy the constraints gðx,!Þ 0 for all !2 , and no structural assumptions are made about the set . In some situations it is natural to require that these constraints hold for almost every (a.e.) !2 . That is, the set is equipped with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1974
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.22.4.892